Fundamental Limits of Coded Caching: From Uncoded Prefetching to Coded Prefetching
نویسندگان
چکیده
منابع مشابه
Fundamental Limits of Caching: Improved Bounds with Coded Prefetching
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F , and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N ≤ K and cache capacities satisfying 1 K ≤ M ≤ N K . The propos...
متن کاملA Note on the Fundamental Limits of Coded Caching
The fundamental limit of coded caching is investigated for the case with N = 3 files and K = 3 users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.
متن کاملFundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching
We consider the problem of private information retrieval (PIR) fromN non-colluding and replicated databases when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. We assume that the databases are unaware of the cache content. We investigate D∗(r) the optimal download cost normalized with the message size as a function of K, N...
متن کاملCache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r of the symbols from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the...
متن کاملOptimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching
Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be errorfree. During non-peak hours, all the users have full access to the files and they fill their local cache with portions of the files available. During delivery phase, each user requests a file and the server delivers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2018
ISSN: 0733-8716,1558-0008
DOI: 10.1109/jsac.2018.2844958